Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polynomials

We say that a permutation is a Motzkin permutation if it avoids 132 and there do not exist a <b such that a < b < b+1. We study the distribution of several statistics in Motzkin permutations, including the length of the longest increasing and decreasing subsequences and the number of rises and descents. We also enumerate Motzkin permutations with additional restrictions, and study the distribution of occurrences of fairly general patterns in this class of permutations. © 2005 Elsevier B.V. All rights reserved.